A privacy-preserving algorithm for distributed constraint optimization
نویسندگان
چکیده
Distributed constraint optimization problems enable the representation of many combinatorial problems that are distributed by nature. An important motivation for such problems is to preserve the privacy of the participating agents during the solving process. The present paper introduces a novel privacy-preserving algorithm for this purpose. The proposed algorithm requires a secure solution of several multiparty computation problems. Consequently, appropriate novel secure protocols are devised and analyzed.
منابع مشابه
P-SyncBB: A Privacy Preserving Branch and Bound DCOP Algorithm
Distributed constraint optimization problems enable the representation of many combinatorial problems that are distributed by nature. An important motivation for such problems is to preserve the privacy of the participating agents during the solving process. The present paper introduces a novel privacy-preserving branch and bound algorithm for this purpose. The proposed algorithm, P-SyncBB, pre...
متن کاملAsymmetric Distributed Constraint Optimization
The standard model of distributed constraints optimization problems (DCOPs), assumes that the cost of a constraint is checked by one of the agents involved in the constraint. For DCOPs this is equivalent to the assumption that each constraint has a global cost which applies to each of the participating agents and in other words that all constraints are symmetric. Many multi agent system (MAS) p...
متن کاملDegree project in Privacy preserving car-parking: a distributed approach
There has been a substantial interest recently in privacy preserving problems in various application domains, including data publishing, data mining, classi cation, secret voting, private querying of database, playing mental poker, and many others. The main constraint is that entities involved in the system are unwilling to reveal the data they hold or make them public. However, they may want t...
متن کاملPrivatizing Constraint Optimization, Thesis Abstract
My thesis proposes novel schemes for achieving privacy in constraint optimization and new ways of analyzing the privacy properties of constraint optimization algorithms. Thus, it aims to contribute to the fields of constraint processing and multiagent systems. Motivation: Many problem domains within constraint processing require algorithms that better accomodate the need for privacy. Two salien...
متن کاملPreserving Privacy in Region Optimal DCOP Algorithms
Region-optimal algorithms are local search algorithms for the solution of Distributed Constraint Optimization Problems (DCOPs). In each iteration of the search in such algorithms, every agent selects a group of agents that comply with some selection criteria (each algorithm specifies different criteria). Then, the agent who selected the group, called the mediator, collects assignment informatio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014